Conflict-free Colorings of Uniform Hypergraphs with Few Edges

A coloring of the vertices of a hypergraph H is called conflict-free if each edge e of H contains a vertex whose color does not repeat in e. The smallest number of colors required for such a coloring is called the conflict-free chromatic number of H, and is denoted by χCF (H). Pach and Tardos proved that for an (2r − 1)-uniform hypergraph H with m edges, χCF (H) is at most of the order of rm logm, for fixed r and large m. They also raised the question whether a similar upper bound holds for r-uniform hypergraphs. In this paper we show that this is not necessarily the case. Furthermore, we provide lower and upper bounds on the minimum number of edges of an r-uniform simple hypergraph that is not conflict-free k-colorable.